Small weak epsilon nets
نویسندگان
چکیده
Given a set P of points in the plane, a set of points Q is a weak ε-net with respect to a family of sets S (e.g., rectangles, disks, or convex sets) if every set of S containing ε|P | points contains a point of Q. In this paper, we determine bounds on εi , the Preprint submitted to Elsevier Science 10 February 2008 smallest epsilon that can be guaranteed for any P when |Q| = i, for small values of i.
منابع مشابه
Small Weak Epsilon-Nets in Three Dimensions
We study the problem of finding small weak ε-nets in three dimensions and provide new upper and lower bounds on the value of ε for which a weak ε-net of a given small constant size exists. The range spaces under consideration are the set of all convex sets and the set of all halfspaces in R3.
متن کاملOn weak $\epsilon$-nets and the Radon number
We show that the Radon number characterizes the existence of weak nets in separable convexity spaces (an abstraction of the euclidean notion of convexity). The construction of weak nets when the Radon number is finite is based on Helly’s property and on metric properties of VC classes. The lower bound on the size of weak nets when the Radon number is large relies on the chromatic number of the ...
متن کاملNew epsilon-net constructions
In this paper, we give simple and intuitive constructions to obtain linear size -nets for α-fat wedges, translations and rotations of a quadrant and axis-parallel three-sided rectangles in R. We also give new constructions using elementary geometry to obtain linear size weak -net for d-hypercubes and disks in R.
متن کاملGENERALIZED FUZZY POLYGROUPS
small Polygroups are multi-valued systems that satisfy group-likeaxioms. Using the notion of “belonging ($epsilon$)” and “quasi-coincidence (q)” offuzzy points with fuzzy sets, the concept of ($epsilon$, $epsilon$ $vee$ q)-fuzzy subpolygroups isintroduced. The study of ($epsilon$, $epsilon$ $vee$ q)-fuzzy normal subpolygroups of a polygroupare dealt with. Characterization and some of the fundam...
متن کاملDependability Models Based on Petri Nets and Markov Chains
This paper shows a way to use stochastic Petri nets as formal availability models instead of Markov chains. Advantages of stochastic Petri nets over Markov models are illustrated on example models. The ability of stochastic Petri nets to represent the structure of modelled design and its use in further research is introduced.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Comput. Geom.
دوره 42 شماره
صفحات -
تاریخ انتشار 2005